منابع مشابه
Approximate Solving of Large p-Median Problems
This paper deals with an approximate approach to the p-median problem. Large instances of the p-median problem can be often met when a real public service system is designed and the discomfort of its customers is minimized. If a large instance of the p-median problem is described by a location-allocation model, then the size of a model often exceeds the acceptable limit for available optimizati...
متن کاملSolving Large p-Median Problems with a Radius Formulation
By means of a model based on a set covering formulation, it is shown how the p-Median Problem can be solved with just a column generation approach, which is embedded in a branch-and-bound framework based on dynamic reliability branching. This method is more than competitive in terms of computational times and size of the instances which have been optimally solved. In particular, problems of siz...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملSolving large p-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search
A hybridisation of a clustering-based technique and of a Variable Neighbourhood Search (VNS) is designed to solve large-scale p-median problems. The approach is based on a multi-stage methodology where learning from previous stages is taken into account when tackling the next stage. Each stage is made up of several subproblems that are solved by a fast procedure to produce good feasible solutio...
متن کاملSolving Large Quadratic Assignment Problems on Computational
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computational platforms. In this article we describe a novel approach to solve QAPs using a state-of-the-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environment and Planning B: Urban Analytics and City Science
سال: 2019
ISSN: 2399-8083,2399-8091
DOI: 10.1177/2399808319892598